A New Inferential Test for Path Models Based on Directed Acyclic Graphs
نویسنده
چکیده
This article introduces a new inferential test for acyclic structural equation models (SEM) without latent variables or correlated errors. The test is based on the independence relations predicted by the directed acyclic graph of the SEMs, as given by the concept of d-separation. A wide range of distributional assumptions and structural functions can be accommodated. No iterative fitting procedures are used, precluding problems involving convergence. Exact probability estimates can be obtained, thus permitting the testing of models with small data sets.
منابع مشابه
Probabilistic Graphical Models Specified by Probabilistic Logic Programs: Semantics and Complexity
We look at probabilistic logic programs as a specification language for probabilistic models, and study their interpretation and complexity. Acyclic programs specify Bayesian networks, and, depending on constraints on logical atoms, their inferential complexity reaches complexity classes #P, #NP, and even #EXP. We also investigate (cyclic) stratified probabilistic logic programs, showing that t...
متن کاملMatrix Representations and Independencies in Directed Acyclic Graphs By
For a directed acyclic graph, there are two known criteria to decide whether any specific conditional independence statement is implied for all distributions factorized according to the given graph. Both criteria are based on special types of path in graphs. They are called separation criteria because independence holds whenever the conditioning set is a separating set in a graph theoretical se...
متن کاملMatrix representations and independencies in directed acyclic graphs
For a directed acyclic graph, there are two known criteria to decide whether any specific conditional independence statement is implied for all distributions factorizing according to the given graph. Both criteria are based on special types of path in graphs. They are called separation criteria because independence holds whenever the conditioning set is a separating set in a graph theoretical s...
متن کاملRandom acyclic orientations of graphs
II Preface This is a Master's thesis written at the department of Mathematics at the Royal Institute of Technology (KTH) in Stockholm, supervised by Svante Linusson. It is assumed that the reader has studied mathematics at an undergraduate level, and that he is well acquainted with some basic graph theory concepts such as paths and cycles. III Summary This paper is about acyclic orientations of...
متن کاملEconomical Graph Discovery
Consider a weighted n-vertex, m-edge graph G with designated source s and destination t. The topology of G is known, while the edge weights are hidden. Our goal is to discover either the edge weights in the graph or a shortest (s, t)-path. This is done by means of agents that traverse different (s, t)-paths in multiple rounds and report back the total cost they incurred. Various cost models are...
متن کامل